Block sampling Kaczmarz–Motzkin methods for consistent linear systems

The sampling Kaczmarz–Motzkin (SKM) method is a generalization of the randomized Kaczmarz and Motzkin method. It first samples some rows coefficient matrix randomly to build set then makes use maximum violation criterion within this determine constraint. Finally, it progress by enforcing single In paper, based on SKM block strategies, we present two methods for consistent linear systems. Specifically, also sample subset an index in using criterion. Unlike method, methods, devise different greedy strategies sets. Then, new make corresponding multiple constraints simultaneously. Numerical experiments show that, same accuracy, our outperform famous deterministic i.e., CGLS terms number iterations computing time.